منابع مشابه
Perfect Sampling of GI/GI/c Queues
We introduce the first class of perfect sampling algorithms for the steady-state distribution of multiserver queues with general interarrival time and service time distributions. Our algorithm is built on the classical dominated coupling from the past protocol. In particular, we use a coupled multi-server vacation system as the upper bound process and develop an algorithm to simulate the vacati...
متن کاملPerfect and nearly perfect sampling of work-conserving queues
We present sampling-based methods to treat work-conserving queueing systems. A variety of models are studied. Besides the First Come First Served (FCFS) queues, many efforts are putted on the accumulating priority queue (APQ), where a customer accumulates priority linearly while waiting. APQs have Poisson arrivals, multi-class customers with corresponding service durations, and single or multip...
متن کاملPerfect Simulation of $M/G/c$ Queues
In this paper we describe a perfect simulation algorithm for the stableM/G/c queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue. Journal of Applied Probability, 48A, 209–213) showed how to build a dominated CFTP algorithm for perfect simulation of the super-stable M/G/c queue operating under First Come First Served discipline, with dominating process pr...
متن کاملAntithetic Coupling for Perfect Sampling
This paper reports some initial investigations of the use of antithetic variates in perfect sampling. A simple random walk example is presented to illustrate the key ingredients of antithetic coupling for perfect sampling as well as its potential benefit. A key step in implementing antithetic coupling is to generate random variates that are negatively associated, a stronger condition than negat...
متن کاملVariable Selection by Perfect Sampling
Variable selection is very important in many fields, and for its resolution many procedures have been proposed and investigated. Among them are Bayesian methods that use Markov chain Monte-Carlo (MCMC) sampling algorithms. A problem with MCMC sampling, however, is that it cannot guarantee that the samples are exactly from the target distributions. This drawback is overcome by related methods kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2018
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-018-9573-2